Functional Decomposition
نویسنده
چکیده
This paper presents a polynomial time algorithm for determining when a univariate rational function is the composition of two rational functions, and, if so, nds those rational functions. This algorithm is valid for rational functions over arbitrary elds and thus also resolves an outstanding problem: polynomial decomposition over elds of nite characteristic. In addition, we present a framework that uniies the previous work on polynomial and rational function decomposition and provides some guidance for future work.
منابع مشابه
Robust stability of fuzzy Markov type Cohen-Grossberg neural networks by delay decomposition approach
In this paper, we investigate the delay-dependent robust stability of fuzzy Cohen-Grossberg neural networks with Markovian jumping parameter and mixed time varying delays by delay decomposition method. A new Lyapunov-Krasovskii functional (LKF) is constructed by nonuniformly dividing discrete delay interval into multiple subinterval, and choosing proper functionals with different weighting matr...
متن کاملSOLUTION OF FUZZY DIFFERENTIAL EQUATIONS UNDER GENERALIZED DIFFERENTIABILITY BY ADOMIAN DECOMPOSITION METHOD
Adomian decomposition method has been applied to solve many functional equations so far. In this article, we have used this method to solve the fuzzy differential equation under generalized differentiability. We interpret a fuzzy differential equation by using the strongly generalized differentiability. Also one concrete application for ordinary fuzzy differential equation with fuzzy input data...
متن کاملOntological Analysis of Functional Decomposition
Functional decomposition is a popular technique applied not only in software engineering but also in business modeling and in technical devices design. As its principle it takes a functional view on a system and analyzes it in terms of functions. However, despite its popularity the notion of functional decomposition seems not to be clear-cut and as such may lead to ambiguities in models based o...
متن کاملIntroduction to the U.S. Constitution and Criminal Justice System
As the name implies, functional decomposition is the processing of breaking functional requirements into smaller parts that can be implemented in software. One of the most important concepts in functional decomposition is it must be possible to reconstruct the original functionality from the parts created in the decomposition process. This rule assures that the decomposition was done correctly ...
متن کاملA Method to Realize Logic Functions using LUTs and OR Gates
This paper introduces a new decomposition method called OR-partitioning, where a logic function is realized as an OR of disjoint sub-functions. This paper also compares three methods to decompose a logic function: The first one is standard functional decomposition; the second one is functional decomposition combined with the Shannon expansion; and the third one is functional decomposition combi...
متن کاملAlgorithms for the Functional Decomposition of Laurent Polynomials
Recent work has detailed the conditions under which univariate Laurent polynomials have functional decompositions. This paper presents algorithms to compute such univariate Laurent polynomial decompositions efficiently and gives their multivariate generalization. One application of functional decomposition of Laurent polynomials is the functional decomposition of so-called “symbolic polynomials...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996